NEW CONVERGENCE METHOD WITH NONMONOTONE LINE SEARCH
نویسندگان
چکیده
منابع مشابه
Convergence of Liu-storey Conjugate Method with Nonmonotone Armijo Line Search
In this paper, we develop a new nonmonotone Armijo-type line search for LS (Liu-Storey) conjugate gradient method for minimizing functions having Lipschitz continuous partial derivatives. The nonmonotone line search can guarantee the global convergence of original LS method under some mild conditions. AMS Subject Classification: 90C30, 65K05
متن کاملA nonmonotone line search method for noisy minimization
is satisfied, where σ is the noise level. Alternatively, the algorithm terminates when the maximum number of 400 ·n function evaluations is exceeded. For each problem, a series of 50 independent runs are conducted. We considered a test run successful if the stopping criterium (1) is satisfied before exceeding the maximal number of function evaluations. To compare the performance of methods from...
متن کاملA Nonmonotone Line Search Method for Symmetric Nonlinear Equations
In this paper, we propose a new method which based on the nonmonotone line search technique for solving symmetric nonlinear equations. The method can ensure that the search direction is descent for the norm function. Under suitable conditions, the global convergence of the method is proved. Numerical results show that the presented method is practicable for the test problems.
متن کاملOn the convergence of the modified Levenberg-Marquardt method with a nonmonotone second order Armijo type line search
Recently, Fan [4, Math. Comput., 81 (2012), pp. 447-466] proposed a modified Levenberg-Marquardt (MLM) method for nonlinear equations. Using a trust region technique, global and cubic convergence of the MLM method is proved [4] under the local error bound condition, which is weaker than nonsingularity. The purpose of the paper is to investigate the convergence properties of the MLM method with ...
متن کاملGlobal Convergence of a New Nonmonotone Algorithm
Abstract: In this study, we study the application of a kind of nonmonotone line search in BFGS algorithm for solving unconstrained optimization problems. This nonmonotone line search is belongs to Armijo-type line searches and when the step size is being computed at each iteration, the initial test step size can be adjusted according to the characteristics of objective functions. The global con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2014
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v92i2.7